Fake Run-Time Selection of Template Arguments in C++

C++ does not support run-time resolution of template type arguments. To circumvent this restriction, we can instantiate a template for all possible combinations of type arguments at compile time and then select the proper instance at run time by evaluation of some provided conditions. However, for templates with multiple type parameters such a solution may easily result in a branching code bloat. We present a template metaprogramming algorithm called for_id that allows the user to select the proper template instance at run time with theoretical minimum sustained complexity of the branching code.Comment: Objects, Models, Components, Patterns (50th International Conference, TOOLS 2012

Localization potential at the Russian market for Skoda Auto Inc.

katedra: KPE; rozsah: 79 s.The market at the territory of Russian Federation is included by some specialists into so called {\clq}qemerging markets``, it means developing markets. In comparison to the rest of Europe, Russian market is ranked among the bigger ones. It is like in the local automotive market. The diploma thesis on the theme ``Localization potential at the Russian market for Skoda Auto Inc.{\crq}q includes the summary of the facts about this market and the analysis of opportunities and obstacles waiting for appropriate foreign investors of automotive industry. With regard to the specialization on the concrete producer of this sphere of business (car company Škoda Auto, Inc.), owning a part of Volkswagen Group Rus OOO assembly factory near Moscow, the summary of a present activity of this company in that market and its daring future plans is the part of my diploma thesis.Trh na území Ruské Federace je některými odborníky začleňován mezi tzv. {\clq}qemerging markets``, tedy rozvíjející se trhy. V porovnání se zbytkem Evropy se ruský trh řadí k těm největším. Obdobně je tomu i s místním trhem s motorovými vozidly. Diplomová práce na téma {\clq}qLokalizační potenciály na trhu v Rusku pro Škoda Auto a.s.`` obsahuje shrnutí faktů o tomto trhu a analýzu příležitostí a překážek, které zde čekají na případné zahraniční investory z automobilového průmyslu. Vzhledem k zaměření na konkrétního výrobce z této oblasti podnikání (společnost Škoda Auto, a.s.), který nedaleko Moskvy vlastní část montážního závodu Volkswagen Group Rus OOO, je součástí mé diplomové práce zhodnocení dosavadního působení této společnosti na onom trhu a jejích smělých plánů do budoucna

Active deep learning method for the discovery of objects of interest in large spectroscopic surveys

Current archives of the LAMOST telescope contain millions of pipeline-processed spectra that have probably never been seen by human eyes. Most of the rare objects with interesting physical properties, however, can only be identified by visual analysis of their characteristic spectral features. A proper combination of interactive visualisation with modern machine learning techniques opens new ways to discover such objects. We apply active learning classification supported by deep convolutional networks to automatically identify complex emission-line shapes in multi-million spectra archives. We used the pool-based uncertainty sampling active learning driven by a custom-designed deep convolutional neural network with 12 layers inspired by VGGNet, AlexNet, and ZFNet, but adapted for one-dimensional feature vectors. The unlabelled pool set is represented by 4.1 million spectra from the LAMOST DR2 survey. The initial training of the network was performed on a labelled set of about 13000 spectra obtained in the region around H$\alpha$ by the 2m Perek telescope of the Ond\v{r}ejov observatory, which mostly contains spectra of Be and related early-type stars. The differences between the Ond\v{r}ejov intermediate-resolution and the LAMOST low-resolution spectrographs were compensated for by Gaussian blurring. After several iterations, the network was able to successfully identify emission-line stars with an error smaller than 6.5%. Using the technology of the Virtual Observatory to visualise the results, we discovered 1013 spectra of 948 new candidates of emission-line objects in addition to 664 spectra of 549 objects that are listed in SIMBAD and 2644 spectra of 2291 objects identified in an earlier paper of a Chinese group led by Wen Hou. The most interesting objects with unusual spectral properties are discussed in detail.Comment: To appear in Astronomy & Astrophysics Section 14- Catalogs and Data, 15 pages, 13 figure

Algorithm 947: Paraperm-parallel generation of random permutations with MPI

An algorithm for parallel generation of a random permutation of a large set of distinct integers is presented. This algorithm is designed for massively parallel systems with distributed memory architectures and the MPI-based runtime environments. Scalability of the algorithm is analyzed according to the memory and communication requirements. An implementation of the algorithm in a form of a software library based on the C++ programming language and the MPI application programming interface is further provided. Finally, performed experiments are described and their results discussed. The biggest of these experiments resulted in a generation of a random permutation of 241 integers in slightly more than four minutes using 131072 CPU cores

Vysokoteplotní fázové transformace kaolinitu v závislosti na krystalinitě

Although kaolinite is one the most important industrial minerals, the processes of its transformation to mullite have not been completely explained so far. The study is focused on kaolinite crystallinity calculation and its effect on high-temperature phases transitions in the series kaolinite-mullite. Samples of purified natural kaolins from several sites were analysed using X-ray diffraction (XRD). Besides the determination of the complex mineral composition, kaolinite crystallite size was calculated from XRD data by the Rietveld method, Scherrer equation and using the Hinckley crystallinity index. Thermal analysis (DSC/TG) was used as the principal approach to examine endothermic and exothermic effects of kaolinite transformations. The course and maximum temperatures of the observed effects were correlated with the original crystallite size of kaolinite. Two samples with different kaolinite crystallinity were also analysed by high-temperature X-ray diffraction (ht-XRD) to study the formation of mullite. Scanning electron microscope (SEM) was used to visualize morphology of kaolinite.It was found out that the original crystallinity of kaolinite affects all three examined processes-kaolinite dehydroxylation, formation of crystalline phases from metakaolinite and development of mullite crystal structure. Dehydroxylation of samples with higher kaolinite crystallinity takes place at higher temperatures. Similar effect applies for the reaction(-s) at the temperature about 980 °C observed at heat flow curve where crystallization of spinel type phase and mullite with very low crystallinity occurs. Broadening of FWHM of the exothermic effect points to decreasing kaolinite crystallinity. Crystallization of mullite exhibits different dependence on kaolinite crystallinity than the previous processes. The results show that mullite with larger crystallite size develops faster from kaolinite of low crystallinity and vice versa

Variable Reordering for a Parallel Envelope Method

We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element (FE) method. A FE mesh is decomposed into the submeshes by a domain decomposition method. The submatrices formed from the submeshes consist of internal and boundary variables. The internal variables are factorized by an envelope method. Prior to the solution, the variables of each submatrix are reordered to minimize the size of its envelope. The boundary variables are ordered last. The Sloan algorithm is used to perform the reordering, but it does not distinguish between internal and boundary variables. We discuss issues of reordering variables in submatrices and introduce a modified version of the Sloan algorithm that takes the boundary variables into consideration. Experiments on 2 sets of benchmarks show that submatrices produced by the proposed modified Sloan algorithm have profiles smaller by approximately 15%. The new reordering algorithm improved the time of solving FE problems with a parallel envelope solver using a standard domain decomposition method by 23%.

Faculty of Electrical Engineering Reordering and Balanced Mesh Partitioning for the Schur Complement Method

Abstract and contributions A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. If memory capacity or computing performance of a single CPU are not sufficient for solving such large linear systems, then parallelisation must be used. The parallel solution by the Schur complement method, on homogeneous parallel machines with distributed memory, is considered. A finite element mesh is partitioned by graph partitioning. Such partitioning results in submeshes with similar numbers of elements. Consequently, mesh partitioning yields domain decomposition in submatrices of similar sizes. The submatrices are partially factorised to compute Schur complements. Prior to the solution, the variables are reordered to minimise the memory requirements to store the submatrices and to minimise the time of the partial factorisation. However, the reordering algorithms designed for the sequential solution are commonly used in parallel solver. The first contribution of this thesis are two improved reordering algorithms for the needs of partial factorisation. Classic graph partitioning produces submatrices of similar sizes. However, the memor